kw.\*:("FAMILLE ABSTRAITE AFL")
Results 1 to 25 of 32
Selection :
A HOMOMORPHIC CHARACTERIZATION OF PRINCIPAL SEMI AFLS WITHOUT USING INTERSECTION WITH REGULAR SETSTURAKAINEN P.1982; INFORMATION SCIENCES (NEW YORK); ISSN 0020-0255; USA; DA. 1982; VOL. 27; NO 2; PP. 141-149; BIBL. 5 REF.Article
AN APPLICATION OF A TRANSFER LEMMADELEAGE JL.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 4; PP. 161-163; BIBL. 2 REF.Article
SOME INDEPENDENT FAMILIES OF ONE-LETTER LANGUAGES.GOLDSTINE J.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 3; PP. 351-369; BIBL. 6 REF.Article
COMPLEXITY OF CLASSES OF LANGUAGES AND OPERATORS.FLAJOLET P; STEYAERT JM.1974; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1974; NO 92; PP. 1-13; ABS. FR.; BIBL. 12 REF.Article
ON THE LARGEST FULL SUBAFL OF AN AFLGINSBURG S; GOLDSTINE J.1972; MATH. SYST. THEORY; U.S.A.; DA. 1972; VOL. 6; NO 3; PP. 241-242; BIBL. 13 REF.Serial Issue
ON INCOMPARABLE ABSTRACT FAMILY OF LANGUAGES (AFL).GINSBURG S; SPANIER EH.1974; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1974; VOL. 9; NO 1; PP. 88-108; BIBL. 13 REF.Article
ON AFL GENERATORS FOR FINITELY ENCODED AFAGINSBURG S; GREIBACH S.1973; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1973; VOL. 7; NO 1; PP. 1-27; BIBL. 8 REF.Serial Issue
ERASING IN CONTEXT-FREE AFLSGREIBACH SA.1972; INFORM. AND CONTROL.; U.S.A.; DA. 1972; VOL. 21; NO 5; PP. 436-465; BIBL. 1 P.Serial Issue
A MORPHIC REPRESENTATION OF COMPLEMENTS OF RECURSIVELY ENUMERABLE SETSEHRENFEUCHT A; ROZENBERG G; RUOHONEN K et al.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 4; PP. 706-714; BIBL. 14 REF.Article
UNIFORMLY ERASABLE AFL.GINSBURG S; GOLDSTINE J; GREIBACH S et al.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 2; PP. 165-182; BIBL. 19 REF.Article
ONE COUNTER LANGUAGES AND THE IRS CONDITION.GREIBACH SA.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 2; PP. 237-247; BIBL. 16 REF.Article
SUR LA STRUCTURE DES LANGAGES ALGEBRIQUESBEAUQUIER J.1982; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1982; VOL. 11; NO 1; PP. 3-19; ABS. ENG; BIBL. 23 REF.Article
A REMARK ABOUT A SUBSTITUTION PROPERTYBEAUQUIER J.1981; MATH. SYST. THEORY; ISSN 0025-5661; DEU; DA. 1981; VOL. 14; NO 2; PP. 189-191; BIBL. 3 REF.Article
THE INCLUSION OF THE SUBSTITUTION CLOSURE OF LINEAR AND ONE-COUNTER LANGUAGES IN THE LARGEST SUB-AFL OF THE FAMILY OF ALGEBRAIC LANGUAGES IS PROPER.BOASSON L.1973; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1973; VOL. 2; NO 5; PP. 135-139; BIBL. 11 REF.Article
ON A LANGUAGE WITHOUT STARCATTEUX M.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 1; PP. 27-30; BIBL. 9 REF.Article
A NOTE ON NON-GENERATORS OF FULL AFL'SASVELD PRJ; ENGELFRIET J.1982; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1982; VOL. 12; NO 1; PP. 13-17; BIBL. 6 REF.Article
MORE ABOUT THE "GEOGRAPHY" OF CONTEXT-FREE LANGUAGESBEAUQUIER J; BERSTEL J.1981; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 49; NO 2; PP. 91-108; BIBL. 20 REF.Article
SIMPLE DETERMINISTIC NTS LANGUAGESFROUGNY C.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 4; PP. 174-178; BIBL. 6 REF.Article
SOME PROPERTIES OF LANGUAGE FAMILIES GENERATED BY COMMUTATIVE LANGUAGESKORTELAINEN J.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 210-217; BIBL. 9 REF.Conference Paper
ABSTRACT FAMILIES OF LENGTH-PRESERVING PROCESSORS.MCCLOSKEY ST.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 3; PP. 394-427; BIBL. 14 REF.Article
MSW SPACESMAURIER HA; SALOMAA A; WOOD D et al.1980; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1980; VOL. 46; NO 3; PP. 187-199; BIBL. 15 REF.Article
A RESULT CONCERNING THE TRIOS GENERATED BY COMMUTATIVE SLIP-LANGUAGESKORTELAINEN J.1982; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1982; VOL. 4; NO 3; PP. 233-236; BIBL. 4 REF.Article
EQUALITY LANGUAGES AND LANGUAGE FAMILIESDASSOW J.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 100-109; BIBL. 10 REF.Conference Paper
MORE ABOUT THE "GEOGRAPHY" OF CONTEXT-FREE LANGUAGESBEAUQUIER J; BERSTEL J.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 183-192; BIBL. 15 REF.Conference Paper
ON NONSTOCHASTIC LANGUAGES AND HOMOMORPHIC IMAGES OF STOCHASTIC LANGUAGESTURAKAINEN P.1981; INF. SCI. (N. YORK); ISSN 0020-0255; USA; DA. 1981; VOL. 24; NO 3; PP. 229-253; BIBL. 34 REF.Article